Finding Longest Paths in Hypercubes: 11 New Lower Bounds for Snakes, Coils, and Symmetrical Coils
نویسندگان
چکیده
منابع مشابه
Snakes, coils, and single-track circuit codes with spread k
The snake-in-the-box problem is concerned with finding a longest induced path in a hypercube Qn. Similarly, the coil-in-the-box problem is concerned with finding a longest induced cycle in Qn. We consider a generalization of these problems that considers paths and cycles where each pair of vertices at distance at least k in the path or cycle are also at distance at least k in Qn. We call these ...
متن کاملDiscovering snake-in-the-box codes through pruning based on the exemplary solutions of an Evolutionary Algorithm
We present a method for searching for simple achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains exemplary snakes using an evolutionary algorithm previously responsible for defining the best-known lower bounds in n-cubes for n = 9, 10, 11, and 12. These snakes are used to define a pruning model that constrains the search space. A depth-first sea...
متن کاملBuilding Snakes from Dna – a Step towards Generalizing the Snake in the Box Problem
The snake in the box problem is an NP-hard problem which has been a challenging problem for both computer scientists and mathematicians. It aims to maximize certain types of paths (snakes) in a graph, an n-dimensional hypercube while satisfying certain constraints described using the concept of spread. This thesis identifies a common pattern among the longest snakes which is very similar to the...
متن کاملNon-uniformity of Clinical Head, Head and Neck, and Body Coils in Magnetic Resonance Imaging (MRI)
Introduction Signal intensity uniformity in a magnetic resonance (MR) image indicates how well the MR imaging (MRI) system represents an object. One of the major sources of image non-uniformity in high-field MRI scanners is inhomogeneity of radio-frequency coil. The aim of this study was to investigate non-uniformity in head, head and neck, and body coils and compare the obtained results to det...
متن کاملExhaustive Search for Maximal Length Coil-in-the-Box Codes
An n-bit coil is a sequence of length n binary strings which corresponds to an induced cycle in the n-dimension hypercube. Coils have a variety of applications and usually the longer the coil the more useful it is in the application. The longest possible coils for n ≤ 7 were found by exhaustive search. Several heuristic based computational techniques including stochastic hill-climbing technique...
متن کامل